finite-state automata meaning in Chinese
有限状态自动机
Examples
- Finite - state automata
有限状态自动机 - This algorithm recovers the absence of the empiric in the case of the fixed - topology network and generates an optimal topology automatically . we end this chapter with some problems in the future . in chapter 2 , we present an evolution strategy to infer fuzzy finite - state automaton , the fitness function of a generated automaton with respect to the set of examples of a fuzzy language , the representation of the transition and the output of the automaton and the simple mutation operators that work on these representations are given
目前，国内外对神经网络与自动机的结合的研究己取得了一系列成果；在第一章，我们首先将对这些结果以及这个领域的研究思想与方法做一个概要的介绍；然后提出一种推导模糊有限状态自动机的构造性算法，解决了仿真实验中所给出的具体网络的隐藏层神经元个数的确定问题；在实验中，我们首先将样本输入带1个隐藏层神经元的反馈网络训练， 150个纪元以后增加神经元，此时的新网络在124纪元时收敛；而blanco [ 3 ]的固定性网络学习好相同的样本需要432个纪元。